Nowa formuła Respect Index

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ordering Unicyclic Graphs with Respect to F-index

F-index of a graph is the sum of the cube of the degrees of the vertices. In this paper, we investigate the F-indices of unicyclic graphs by introducing some transformation, and characterize the unicyclic graphs with the first five largest F-indices and the unicyclic graphs with the first two smallest F-indices, respectively.

متن کامل

On extremal trees with respect to the $F$-index

In a study on the structure–dependency of the total π-electron energy from 1972, Trinajstić and one of the present authors have shown that it depends on the sums ∑ v∈V d(v) 2 and ∑ v∈V d(v) , where d(v) is the degree of a vertex v of the underling molecular graph G. The first sum was later named first Zagreb index and over the years became one of the most investigated graph–based molecular stru...

متن کامل

Integration with Respect to Fractional Local times with Hurst Index

In this paper, we study the stochastic integration with respect to local times of fractional Brownian motion B with Hurst index 1/2 < H < 1. As a related problem we define the weighted quadratic covariation [f(B), B ] ) of f(B) and B as follows n−1

متن کامل

Extremal Unicyclic and Bicyclic Graphs with Respect to Harary Index

The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. In this paper, we determined the extremal (maximal and minimal) unicyclic and bicyclic graphs with respect to Harary index. 2010 Mathematics Subject Classification: 05C90

متن کامل

Extremal trees with respect to Hosoya Index and Merrifield-Simmons Index

We characterize the trees T with n vertices whose Hosoya index (total number of matchings) is Z(T ) > 16fn−5 resp. the trees whose Merrifield-Simmons index (total number of independent subsets) is σ(T ) < 18fn−5 + 21fn−6, where fk is the kth Fibonacci number. It turns out that all the trees satisfying the inequality are tripodes (trees with exactly three leaves) and the path in both cases. Furt...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Prace Naukowe Uniwersytetu Ekonomicznego we Wrocławiu

سال: 2014

ISSN: 1899-3192,2392-0041

DOI: 10.15611/pn.2014.347.26